Deciding Niteness of Petri Nets up to Bisimulation
نویسنده
چکیده
We study the following problems for strong and weak bisim-ulation equivalence: given a labelled Petri net and a nite transition system, are they equivalent?; given a labelled Petri net, is it equivalent to some (unspeciied) nite transition system? We show that both problems are decidable for strong bisimulation and undecidable for weak bisimulation.
منابع مشابه
Time Process Equivalences for Time Petri Nets
In the core of every theory of systems lies a notion of equivalence between systems: it indicates which particular aspects of systems behaviors are considered to be observable. In concurrency theory, a variety of observational equivalences has been promoted, and the relationships between them have been quite wellunderstood. In order to investigate the performance of systems (e.g. the maximal ti...
متن کاملHistory Preserving Bisimulation for Contextual Nets
We investigate the notion of history preserving bisimulation [15, 18, 3] for contextual P/T nets, a generalization of ordinary P/T Petri nets where a transition may check for the presence of tokens without consuming them (non-destructive read operations). A first equivalence, simply called HP-bisimulation, is based on Winskel’s prime event structures. A finer equivalence, called RHP-bisimulatio...
متن کاملPetri nets and resource bisimulation
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Pe...
متن کاملMarkov Automata: Deciding Weak Bisimulation by means of non-naively Vanishing States
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For this purpose, different notions of vanishing states (a concept originating from the area of Generalised Stochastic Petri Nets) are defined. In particular, non-näıvely vanishing states are shown to be essential for relating the concepts of (state-based) näıve weak bisimulation and (distribution-based) wea...
متن کاملPlace Bisimulation Equivalences for Design of Concurrent Systems
In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones. The relationships of all the equivalence notions are examined, and their preservation by refinements is investigated to find out which of these relations may be used in top-down design. It is demonstrated that the place bisimulation equivalences may...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996